Line Problems in Nonlinear Computational Geometry
نویسنده
چکیده
We first review some topics in the classical computational geometry of lines, in particular the O(n) bounds for the combinatorial complexity of the set of lines in R interacting with n objects of fixed description complexity. The main part of this survey is recent work on a core algebraic problem—studying the lines tangent to k spheres that also meet 4−k fixed lines.
منابع مشابه
Sweep Line Algorithm for Convex Hull Revisited
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
متن کاملA dynamic programming approach for solving nonlinear knapsack problems
Nonlinear Knapsack Problems (NKP) are the alternative formulation for the multiple-choice knapsack problems. A powerful approach for solving NKP is dynamic programming which may obtain the global op-timal solution even in the case of discrete solution space for these problems. Despite the power of this solu-tion approach, it computationally performs very slowly when the solution space of the pr...
متن کاملMinimizing Stoppage Cost of an Assembly Line Using Genetic Algorithm
This paper presents a nonlinear mixed-integer programming model to minimize the stoppage cost of mixed-model assembly lines. Nowadays, most manufacturing firms employ this type of line due to the increasing varieties of products in their attempts to quickly respond to diversified customer demands. Advancement of new technologies, competitiveness, diversification of products, and large customer ...
متن کاملMinimizing Stoppage Cost of an Assembly Line Using Genetic Algorithm
This paper presents a nonlinear mixed-integer programming model to minimize the stoppage cost of mixed-model assembly lines. Nowadays, most manufacturing firms employ this type of line due to the increasing varieties of products in their attempts to quickly respond to diversified customer demands. Advancement of new technologies, competitiveness, diversification of products, and large customer ...
متن کامل2-stage explicit total variation diminishing preserving Runge-Kutta methods
In this paper, we investigate the total variation diminishing property for a class of 2-stage explicit Rung-Kutta methods of order two (RK2) when applied to the numerical solution of special nonlinear initial value problems (IVPs) for (ODEs). Schemes preserving the essential physical property of diminishing total variation are of great importance in practice. Such schemes are free of spurious o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006